a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
↳ QTRS
↳ DependencyPairsProof
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
MARK(p(X)) → A__P(mark(X))
MARK(s(X)) → MARK(X)
A__F(s(0)) → A__P(s(0))
MARK(cons(X1, X2)) → MARK(X1)
MARK(f(X)) → A__F(mark(X))
A__F(s(0)) → A__F(a__p(s(0)))
MARK(p(X)) → MARK(X)
MARK(f(X)) → MARK(X)
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
MARK(p(X)) → A__P(mark(X))
MARK(s(X)) → MARK(X)
A__F(s(0)) → A__P(s(0))
MARK(cons(X1, X2)) → MARK(X1)
MARK(f(X)) → A__F(mark(X))
A__F(s(0)) → A__F(a__p(s(0)))
MARK(p(X)) → MARK(X)
MARK(f(X)) → MARK(X)
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
A__F(s(0)) → A__F(a__p(s(0)))
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A__F(s(0)) → A__F(a__p(s(0)))
The value of delta used in the strict ordering is 47/2.
POL(a__p(x1)) = 1/4 + (1/4)x_1
POL(A__F(x1)) = (2)x_1
POL(s(x1)) = (4)x_1
POL(p(x1)) = 1/4 + (1/4)x_1
POL(0) = 4
a__p(X) → p(X)
a__p(s(0)) → 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
MARK(s(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(p(X)) → MARK(X)
MARK(f(X)) → MARK(X)
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(s(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(p(X)) → MARK(X)
MARK(f(X)) → MARK(X)
The value of delta used in the strict ordering is 1/8.
POL(cons(x1, x2)) = 2 + (2)x_1 + (1/2)x_2
POL(MARK(x1)) = (1/4)x_1
POL(f(x1)) = 1 + x_1
POL(s(x1)) = 1 + (2)x_1
POL(p(x1)) = 1/2 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a__f(0) → cons(0, f(s(0)))
a__f(s(0)) → a__f(a__p(s(0)))
a__p(s(0)) → 0
mark(f(X)) → a__f(mark(X))
mark(p(X)) → a__p(mark(X))
mark(0) → 0
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__f(X) → f(X)
a__p(X) → p(X)